Clustering Fiber Traces Using Normalized Cuts
نویسندگان
چکیده
In this paper we present a framework for unsupervised segmentation of white matter fiber traces obtained from diffusion weighted MRI data. Fiber traces are compared pairwise to create a weighted undirected graph which is partitioned into coherent sets using the normalized cut (N cut) criterion. A simple and yet effective method for pairwise comparison of fiber traces is presented which in combination with the N cut criterion is shown to produce plausible segmentations of both synthetic and real fiber trace data. Segmentations are visualized as colored stream-tubes or transformed to a segmentation of voxel space, revealing structures in a way that looks promising for future explorative studies of diffusion weighted MRI data.
منابع مشابه
Feature Selection Framework for White Matter Fiber Clustering Based on Normalized Cuts
Due to its ability to automatically identify spatially and functionally related white matter fiber bundles, fiber clustering has the potential to improve our understanding of white matter anatomy. The normalized cuts (NCut) criterion has proven to be a suitable method for clustering fiber tracts. In this work, we show that the NCut value can be used for unsupervised feature selection as a measu...
متن کاملA Feature Space View of Spectral Clustering
The transductive SVM is a semi-supervised learning algorithm that searches for a large margin hyperplane in feature space. By withholding the training labels and adding a constraint that favors balanced clusters, it can be turned into a clustering algorithm. The Normalized Cuts clustering algorithm of Shi and Malik, although originally presented as spectral relaxation of a graph cut problem, ca...
متن کاملClustering with Normalized Cuts is Clustering with a Hyperplane
We present a set of clustering algorithms that identify cluster boundaries by searching for a hyperplanar gap in unlabeled data sets. It turns out that the Normalized Cuts algorithm of Shi and Malik [1], originally presented as a graph-theoretic algorithm, can be interpreted as such an algorithm. Viewing Normalized Cuts under this light reveals that it pays more attention to points away from th...
متن کاملNotes on Elementary Spectral Graph Theory. Applications to Graph Clustering Using Normalized Cuts
These are notes on the method of normalized graph cuts and its applications to graph clustering. I provide a fairly thorough treatment of this deeply original method due to Shi and Malik, including complete proofs. I include the necessary background on graphs and graph Laplacians. I then explain in detail how the eigenvectors of the graph Laplacian can be used to draw a graph. This is an attrac...
متن کاملAutomatically finding clusters in normalized cuts
Normalized Cuts is a state-of-the-art spectral method for clustering. By applying spectral techniques, the data becomes easier to cluster and then k-means is classically used. Unfortunately the number of clusters must be manually set and it is very sensitive to initialization. Moreover, k-means tends to split large clusters, to merge small clusters, and to favor convex-shaped clusters. In this ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Medical image computing and computer-assisted intervention : MICCAI ... International Conference on Medical Image Computing and Computer-Assisted Intervention
دوره 3216/2004 3216 شماره
صفحات -
تاریخ انتشار 2004